Elements of large order in π∗(SU(n))
نویسندگان
چکیده
منابع مشابه
ELEMENTS OF LARGE ORDER IN π∗(SU(n))
with e ≥ n− 1− [n+2p−3 p2 ] + [ 2−p−1 p3 ]. Computing homotopy groups is a notoriously difficult problem. The groups πi(S ) are known only for relatively small values of i− n, and quickly become quite complicated, but the celebrated exponent theorem of [7] showed expp(S ) = n for all odd primes p. Groups πi(SU(n)) have been computed for small values of i − n by many topologists, with all known ...
متن کاملeffect of sub-grid scales on large eddy simulation of particle deposition in a turbulent channel flow
چکیده ندارد.
15 صفحه اولA Characterization of the Suzuki Groups by Order and the Largest Elements Order
One of the important problems in group theory is characterization of a group by a given property, that is, to prove there exist only one group with a given property. Let be a finite group. We denote by the largest order of elements of . In this paper, we prove that some Suzuki groups are characterizable by order and the largest order of elements. In fact, we prove that if is a group with an...
متن کاملAn Additive Problem in Finite Fields with Powers of Elements of Large Multiplicative Order
For a given finite field Fq, we study sufficient conditions to guarantee that the set {θ 1 + θ y 2 : 1 ≤ x ≤ M1, 1 ≤ y ≤ M2} represents all the nonzero elements of Fq. We investigate the same problem for θ 1 − θ y 2 and as a consequence we prove that any element in the finite field of q elements has a representation of the form θ − θ, 1 ≤ x, y ≤ √ 2q whenever θ has multiplicative order at least...
متن کاملasymptotic property of order statistics and sample quntile
چکیده: فرض کنید که تابعی از اپسیلون یک مجموع نامتناهی از احتمالات موزون مربوط به مجموع های جزئی براساس یک دنباله از متغیرهای تصادفی مستقل و همتوزیع باشد، و همچنین فرض کنید توابعی مانند g و h وجود دارند که هرگاه امید ریاضی توان دوم x متناهی و امیدریاضی x صفر باشد، در این صورت می توان حد حاصلضرب این توابع را بصورت تابعی از امید ریاضی توان دوم x نوشت. حالت عکس نیز برقرار است. همچنین ما با استفاده...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology
سال: 1998
ISSN: 0040-9383
DOI: 10.1016/s0040-9383(97)00022-0